94,686 research outputs found

    Endomorphism algebras of maximal rigid objects in cluster tubes

    Full text link
    Given a maximal rigid object TT of the cluster tube, we determine the objects finitely presented by TT. We then use the method of Keller and Reiten to show that the endomorphism algebra of TT is Gorenstein and of finite representation type, as first shown by Vatne. This algebra turns out to be the Jacobian algebra of a certain quiver with potential, when the characteristic of the base field is not 3. We study how this quiver with potential changes when TT is mutated. We also provide a derived equivalence classification for the endomorphism algebras of maximal rigid objects.Comment: 28 pages. The way of numbering subsections/propositions/theorems/lemmas/corollaries changed, several references added or updated, a few mistakes and typos corrected, some pictures added. To appear in Comm. Al

    Ordered Exchange Graphs

    Full text link
    The exchange graph of a cluster algebra encodes the combinatorics of mutations of clusters. Through the recent "categorifications" of cluster algebras using representation theory one obtains a whole variety of exchange graphs associated with objects such as a finite-dimensional algebra or a differential graded algebra concentrated in non-positive degrees. These constructions often come from variations of the concept of tilting, the vertices of the exchange graph being torsion pairs, t-structures, silting objects, support Ï„\tau-tilting modules and so on. All these exchange graphs stemming from representation theory have the additional feature that they are the Hasse quiver of a partial order which is naturally defined for the objects. In this sense, the exchange graphs studied in this article can be considered as a generalization or as a completion of the poset of tilting modules which has been studied by Happel and Unger. The goal of this article is to axiomatize the thus obtained structure of an ordered exchange graph, to present the various constructions of ordered exchange graphs and to relate them among each other.Comment: References updated, and Theorem A.7 adde
    • …
    corecore